Continuous visible nearest neighbor query processing in spatial databases
نویسندگان
چکیده
منابع مشابه
Multiple k Nearest Neighbor Query Processing in Spatial Network Databases
This paper concerns the efficient processing of multiple k nearest neighbor queries in a road-network setting. The assumed setting covers a range of scenarios such as the one where a large population of mobile service users that are constrained to a road network issue nearest-neighbor queries for points of interest that are accessible via the road network. Given multiple k nearest neighbor quer...
متن کاملOn efficient mutual nearest neighbor query processing in spatial databases
This paper studies a new form of nearest neighbor queries in spatial databases, namely, mutual nearest neighbor (MNN) search. Given a set D of objects and a query object q, an MNN query returns from D, the set of objects that are among the k 1 (P1) nearest neighbors (NNs) of q; meanwhile, have q as one of their k 2 (P1) NNs. Although MNN queries are useful in many applications involving decisio...
متن کاملContinuous visible k nearest neighbor query on moving objects
A visible k nearest neighbor (Vk NN) query retrieves k objects that are visible and nearest to the query object, where “visible”means that there is no obstacle between an object and the query object. Existing studies on the Vk NN query have focused on static data objects. In this paper we investigate how to process the query on moving objects continuously. We queries. We exploit spatial proximi...
متن کاملFast Nearest-Neighbor Query Processing in Moving-Object Databases
A desirable feature in spatio-temporal databases is the ability to answer future queries, based on the current data characteristics (reference position and velocity vector). Given a moving query and a set of moving objects, a future query asks for the set of objects that satisfy the query in a given time interval. The difficulty in such a case is that both the query and the data objects change ...
متن کاملRanked Continuous Visible Nearest Neighbor Search
Physical obstacles (e.g., buildings, hills, and blindages, etc.) are ubiquitous in the real world, and their existence may affect the visibility between objects and thus the result of spatial queries such as range query, nearest neighbor search, and spatial join, etc. In this paper, we study a novel type of spatial queries, namely, ranked continuous visible nearest neighbor (RCVNN) search, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The VLDB Journal
سال: 2010
ISSN: 1066-8888,0949-877X
DOI: 10.1007/s00778-010-0200-z